\hypertarget{classtree_1_1btree__inorder__iterator}{\section{tree\-:\-:btree\-\_\-inorder\-\_\-iterator$<$ T, N $>$ Class Template Reference}
\label{classtree_1_1btree__inorder__iterator}\index{tree\-::btree\-\_\-inorder\-\_\-iterator$<$ T, N $>$@{tree\-::btree\-\_\-inorder\-\_\-iterator$<$ T, N $>$}}
}


{\ttfamily \#include $<$binary\-\_\-tree\-\_\-iter.\-h$>$}



Inheritance diagram for tree\-:\-:btree\-\_\-inorder\-\_\-iterator$<$ T, N $>$\-:
\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=264pt]{classtree_1_1btree__inorder__iterator__inherit__graph}
\end{center}
\end{figure}


Collaboration diagram for tree\-:\-:btree\-\_\-inorder\-\_\-iterator$<$ T, N $>$\-:
\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=350pt]{classtree_1_1btree__inorder__iterator__coll__graph}
\end{center}
\end{figure}
\subsection*{Public Member Functions}
\begin{DoxyCompactItemize}
\item 
\hypertarget{classtree_1_1btree__inorder__iterator_abb3121aadd921041e0af5a28d527eaf2}{{\bfseries btree\-\_\-inorder\-\_\-iterator} (N $\ast$node)}\label{classtree_1_1btree__inorder__iterator_abb3121aadd921041e0af5a28d527eaf2}

\item 
\hypertarget{classtree_1_1btree__inorder__iterator_ae42f42822641ec3d55e2e570f9e0d897}{void {\bfseries increment} ()}\label{classtree_1_1btree__inorder__iterator_ae42f42822641ec3d55e2e570f9e0d897}

\end{DoxyCompactItemize}
\subsection*{Private Attributes}
\begin{DoxyCompactItemize}
\item 
\hypertarget{classtree_1_1btree__inorder__iterator_aa2586ca852a9b462b0774af427a7a10f}{N $\ast$ {\bfseries m\-\_\-\-Next\-Node}}\label{classtree_1_1btree__inorder__iterator_aa2586ca852a9b462b0774af427a7a10f}

\item 
\hypertarget{classtree_1_1btree__inorder__iterator_a35c2412b7ad6f89a8ca7eeb2eef3f413}{std\-::stack$<$ N $\ast$ $>$ {\bfseries m\-\_\-\-Stack}}\label{classtree_1_1btree__inorder__iterator_a35c2412b7ad6f89a8ca7eeb2eef3f413}

\end{DoxyCompactItemize}
\subsection*{Additional Inherited Members}


\subsection{Detailed Description}
\subsubsection*{template$<$typename T, typename N$>$class tree\-::btree\-\_\-inorder\-\_\-iterator$<$ T, N $>$}

traverses the tree in inorder(symmetric order -- left, root, right) using a stack 

The documentation for this class was generated from the following file\-:\begin{DoxyCompactItemize}
\item 
tree/binary\-\_\-tree\-\_\-iter.\-h\end{DoxyCompactItemize}
